Randomized heuristics for exploiting Jacobian scarcity

Randomized Heuristics for Exploiting Jacobian Scarcity

We describe a code transformation technique that, given code for a vector function F , produces code suitable for computing collections of Jacobian-vector products F (x)ẋ or Jacobiantranspose-vector products F (x) ȳ. Exploitation of scarcity a measure of the degrees of freedom in the Jacobian matrix means solving a combinatorial optimization problem that is believed to be hard. Our heuristics t...

Exploiting Design Heuristics for Automatic Problem Detection

Reengineering large systems requires support for detecting design problems automatically. A lot of rules and guidelines about good design can be found in the literature. Since these were originally intented to be used by human developers, it was not sure if they were suitable to be automated. We present our approach to formalize these rules, extract design information from legacy source code an...

Strategies and heuristics for exploiting tree-decompositions of constraint networks

This paper deals with methods exploiting treedecomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches, by defining three classes of variable orders more and more dynamic which preserve the time complexity bound and an extension of this theoretical time complexity bound to increase the dynamic aspect of these orders. We propose heuri...

Randomized heuristics for the Max-Cut problem

Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized. It is a well-known NP-hard problem with applications in several fields, including VLSI design and statistical physics. In this paper, a greedy randomized adaptive search p...

Randomized heuristics for the Capacitated Clustering Problem